Multi-Objective Electric Vehicles Scheduling Using Elitist Non-Dominated Sorting Genetic Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II

Abstract. Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) computational complexity (where is the number of objectives and is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algor...

متن کامل

A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II

Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(mN3) computational complexity (where m is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algo...

متن کامل

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms

A multi-objective vehicle path planning method has been proposed to optimize path length, path safety and path smoothness using the elitist non-dominated sorting genetic algorithm (NSGA-II). Four different path representation schemes that begin its coding from the start point and move one grid at a time towards the destination point are proposed. Minimization of traveled distance, maximization ...

متن کامل

Multiprocessor Scheduling and Performance Evaluation Using Elitist Non Dominated Sorting Genetic Algorithm for Independent Task

Task scheduling plays an important part in the improvement of parallel and distributed systems. The problem of task scheduling has been shown to be NP hard. The time consuming is more to solve the problem in deterministic techniques. There are algorithms developed to schedule tasks for distributed environment, which focus on single objective. The problem becomes more complex, while considering ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Sciences

سال: 2020

ISSN: 2076-3417

DOI: 10.3390/app10227978